Cutting a Convex Polygon Out of a Circle
نویسندگان
چکیده
Efficient cutting strategy of a geometric shape, P out of another geometric shape, Q has been extensively studied in recent years. A number of variations of this problem has been addressed including P being convex or concave, cuts being line cut or ray cut, Q being a polygon or a circle etc. In this paper we give a simple linear time O (log n)-approximation algorithm for the problem where Q is a circle and n is the number of vertices of the convex polygon P. We also give a constant factor approximation algorithm for this problem which runs in O(n) time.
منابع مشابه
On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost
The problem of cutting a convex polygon P out of a planar piece of material Q (P is already drawn on Q) with minimum total cutting cost is a well studied problem in computational geometry that has been studied with several variations such as P and Q are convex or non-convex polygons, Q is a circle, and the cuts are line cuts or ray cuts. In this paper, we address this problem without the restri...
متن کاملNaXi Pictographs Input Method and WEFT Hai Guo and Jing-ying Zhao A Systematic Decision Criterion for Urban Agglomeration: Methodology for Causality Measurement at Provincial Scale Yaobin Liu and Li Wan Application of Improved Fuzzy Controller for Smart Structure
The problem of cutting a convex polygon P out of a piece of planar material Q with minimum total cutting length is a well studied problem in computational geometry. Researchers studied several variations of the problem, such as P and Q are convex or non-convex polygons and the cuts are line cuts or ray cuts. In this paper we consider yet another variation of the problem where Q is a circle and ...
متن کاملCutting Out Polygons
In this paper, we present approximation algorithms for the problem of cutting out a convex polygon P with n vertices from another convex polygon Q with m vertices by a sequence of guillotine cuts of smallest total length. Specifically, we give an O(n + m) running time, constant factor approximation algorithm, and an O(n+m) running time, O(log n)-factor approximation algorithm for cutting P out ...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملOn polygon numbers of circle graphs and distance hereditary graphs
Circle graphs are intersection graphs of chords in a circle and kpolygon graphs are the intersection graphs of chords in a convex ksided polygon where each chord has its endpoints on distinct sides. Every k-polygon graph is a circle graph and every circle graph is a kpolygon graph for some k. The polygon number ψ(G) of a circle graph G is the minimum k such that G is a k-polygon graph and the p...
متن کامل